Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial
نویسندگان
چکیده
منابع مشابه
On Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملEdge-decomposition of Graphs into Copies of a Tree with Four Edges
We study edge-decompositions of highly connected graphs into copies of a given tree. In particular we attack the following conjecture by Barát and Thomassen: for each tree T , there exists a natural number kT such that if G is a kT -edge-connected graph, and |E(T )| divides |E(G)|, then E(G) has a decomposition into copies of T . As one of our main results it is sufficient to prove the conjectu...
متن کاملDecomposing the hypercube Qn into n isomorphic edge-disjoint trees
We show that the edge set of the n-dimensional hypercube Qn is the disjoint union of the edge sets of n isomorphic trees.
متن کاملDecomposition of cartesian products of regular graphs into isomorphic trees
We extend the ideas of Snevily and Avgustinovitch to enlarge the families of 2mregular graphs and m-regular bipartite graphs that are known to decompose into isomorphic copies of a tree T with m edges. For example, consider r1, . . . , rk with ∑k i=1 ri = m. If T has a k-edge-coloring with ri edges of color i such that every path in T uses some color once or twice, then every cartesian product ...
متن کاملOn the decomposition of Cayley graphs into isomorphic trees
We prove a theorem about the decomposition of certain n-regular Cayley graphs into any tree with n edges. This result implies that the product of any r cycles of even length and the cube Qs decomposes into copies of any tree with 2r + sedges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1997
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.1735